A Survey of Minimum Saturated Graphs
نویسندگان
چکیده
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F -free for any F ∈ F but for any edge e in the complement of G the (hyper)graph G + e contains some F ∈ F . We survey the problem of determining the minimum size of an F-saturated (hyper)graph and collect many open problems and conjectures.
منابع مشابه
On the Number of Edges in a Minimum C6-Saturated Graph
A graph is said to be Ck-saturated if it contains no cycles of length k but does contain such a cycle after the addition of any edge in the complement of the graph. Determining the minimum size of Ck-saturated graphs is one of the interesting problems on extremal graphs. The exact minimum sizes are known for k = 3, 4 and 5, but only general bounds are shown for k ≥ 6. This paper deals with boun...
متن کاملSize of weakly saturated graphs
Let P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which are contained in G. A graph G is said to be weakly P-saturated, if G ∈ P and the edges of the complement of G can be labelled e1, e2, . . . , el in such way that for i= 0, 1, . . . , l− 1 the inequality kP(Gi+1)> kP(Gi) holds, whereG0=G,Gi+1=Gi + ei andGl =Kn. The minimum possible size of weakly P-saturate...
متن کاملAll minimum C5-saturated graphs
A graph is C5-saturated if it has no five-cycle as a subgraph, but does contain a C5 after the addition of any new edge. Extending our previous result, we prove that the minimum number of edges in a C5-saturated graph on n vertices is sat(n, C5) = ⌈10(n − 1)/7⌉ − 1 for 11 ≤ n ≤ 14, or n = 16, 18, 20, and is ⌈10(n − 1)/7⌉ for all other n ≥ 5, and we also prove that the only C5-saturated graphs w...
متن کاملThe Edge Spectrum of K4-Saturated Graphs
Any H-free graph G is called H-saturated if the addition of any edge e / ∈ E(G) results in H as a subgraph of G. The minimum size of an H-saturated graph on n vertices is denoted by sat(n,H). The edge spectrum for the family of graphs with property P is the set of all sizes of graphs with property P . In this paper, we find the edge spectrum of K4-saturated graphs. We also show that if G is a K...
متن کاملA note on minimum K2, 3-saturated graphs
A graph G is said to be K2,3-saturated if G contains no copy of K2,3 as a subgraph, but for any edge e in the complement of G the graph G + e does contain a copy of K2,3. The minimum number of edges of a K2,2-saturated graph of given order n was precisely determined by Ollmann [6]. Here, we determine the asymptotic behavior for the minimum number of edges in a K2,3-saturated graph.
متن کامل